Unusually Large Gaps between Consecutive Primes
نویسندگان
چکیده
Let G(x) denote the largest gap between consecutive grimes below x, In a series of papers from 1935 to 1963, Erdos, Rankin, and Schonhage showed that G(x) :::: (c + o( I)) logx loglogx log log log 10gx(loglog logx) -2, where c = eY and y is Euler's constant. Here, this result is shown with c = coeY where Co = 1.31256... is the solution of the equation 4/ Co e -4/co = 3 . The principal new tool used is a result of independent interest, namely, a mean value theorem for generalized twin primes lying in a residue class with a large modulus.
منابع مشابه
Small Gaps between Primes I
Finding mathematical proofs for easily observed properties of the distribution of prime numbers is a difficult and often humbling task, at least for the authors of this paper. The twin prime conjecture is a famous example of this, but we are concerned here with the much more modest problem of proving that there are arbitrarily large primes that are “unusually close ” together. Statistically thi...
متن کاملLarge gaps between consecutive prime numbers containing perfect powers
For any positive integer k, we show that infinitely often, perfect k-th powers appear inside very long gaps between consecutive prime numbers, that is, gaps of size ck log p log2 p log4 p (log3 p) 2 , where p is the smaller of the two primes.
متن کاملLarge Gaps between Consecutive Prime Numbers
Let G(X) denote the size of the largest gap between consecutive primes below X . Answering a question of Erdős, we show that G(X) > f(X) logX log logX log log log logX (log log logX) , where f(X) is a function tending to infinity with X . Our proof combines existing arguments with a random construction covering a set of primes by arithmetic progressions. As such, we rely on recent work on the e...
متن کاملSome Conjectures on the Gaps between Consecutive Primes Marek Wolf
Five conjectures on the gaps between consecutive primes are formulated. One expresses the number of twins below a given bound directly by (N). These conjectures are compared with the computer results and a good agreement is found.
متن کاملBounded gaps between primes
It is proved that lim inf n→∞ (pn+1 − pn) < 7× 10, where pn is the n-th prime. Our method is a refinement of the recent work of Goldston, Pintz and Yildirim on the small gaps between consecutive primes. A major ingredient of the proof is a stronger version of the Bombieri-Vinogradov theorem that is applicable when the moduli are free from large prime divisors only (see Theorem 2 below), but it ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1981